Scheduling in synchronous networks and the greedy algorithm

fault location in power distribution networks using matching algorithm

چکیده رساله/پایان نامه : تاکنون روش‏های متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روش‏ها در شبکه توزیع به دلایلی همچون وجود انشعاب‏های متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تک‏فاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...

sGSA: A SDMA-OFDMA greedy scheduling algorithm for WiMAX networks

Future wireless networks need to address the predicted growth in mobile traffic volume, expected to have an explosive growth in the next five years mainly driven by video and web applications. Transmission schemes based on Orthogonal Frequency Division Multiple Access (OFDMA) combined with Space Division Multiple Access (SDMA) techniques are key promising technologies to increase current spectr...

Greedy algorithm for disassembly line scheduling

Delft University of Technology Greedy Gossip Algorithm with Synchronous Communication for Wireless Sensor Networks

Randomized gossip (RG) based distributed averaging has been popular for wireless sensor networks (WSNs) in multiple areas. With RG, randomly two adjacent nodes are selected to communicate and exchange information iteratively until consensus is reached. One way to improve the convergence speed of RG is to use greedy gossip with eavesdropping (GGE). Instead of randomly selecting two nodes, GGE se...

Correctness of the greedy algorithm for minimum lateness scheduling

We are given n jobs 1, 2, . . . n, and a release time r. Each job i has duration t(i) > 0 and deadline d(i). A schedule s defines, for each job i, a start time s(i) ≥ r so that for any two distinct jobs i and j the intervals [s(i), s[i] + t(i)] and [s(j), s(j) + t(j)] do not overlap (one finishes no later than the other starts). The lateness l(i) of job i in schedule s is the amount of time by ...